Closed Reentrant Queueing Networks under Affine Index Policies: Throughput Bounds, Examples and Asymptotic Loss
نویسندگان
چکیده
We extend linear programming performance evaluation methods to closed reentrant queueing networks. The approach automatically generates the parameters for a surrogate of the differential cost function and enables us to obtain bounds on the system throughput at reduced computational cost than exact solution methodologies. A comparison study of the bounds with the actual performance for tractable examples is conducted. The results show that the bounds can be quite good, in particular for unbalanced networks. For the closed version of a well known unstable network, we investigate the performance of the bounds and explore the asymptotic loss of the system.
منابع مشابه
Closed Queueing Networks in Heavy Traac: Fluid Limits and Eeciency
We address the behavior of stochastic Markovian closed queueing networks in heavy traac, i.e., when the population trapped in the network increases to innnity. All service time distributions are assumed to be exponential. We show that the uid limits of the network can be used to study the asymptotic throughput in the innnite population limit. As applications of this technique, we show the eecie...
متن کاملFluid Limits and the Eeciency of Scheduling Policies for Stochastic Closed Reentrant Lines in Heavy Traac
In this paper, we address the behavior of stochastic closed reentrant lines in heavy traac, i.e., when the population of the resulting closed queueing network increases without bound. We show that the uid limits of the network can be used to study the asymptotic throughput in the innnite population limit. As applications of this technique, the Last Buuer First Serve (LBFS) scheduling policy, an...
متن کاملNew Linear Programming Performance
We develop new linear program performance bounds for closed reentrant queueing networks based on an inequality relaxation of the average cost equation. The approach exploits the fact that the transition probabilities under certain policies of closed queueing networks are invariant within certain regions of the state space. This invariance suggests the use of a piecewise quadratic function as a ...
متن کاملThe throughput of irreducible closed Markovian queueing networks: Functional bounds, asymptotic loss, e ciency, and the Harrison-Wein conjectures
Let N be the population of an irreducible closed Markovian queueing network, and denote by u(N) the throughput of a scheduling policy u. The policy u is said to be e cient if limN!+1 u(N) = , where is the capacity of a bottleneck station. The quantity J(u) := limN!1 N( u(N)) is called the asymptotic loss of u. The policy u is said to be asymptotically optimal if J(u) is as small as it can be. F...
متن کاملNon-product form equilibrium probabilities in a class of two-station closed reentrant queueing networks
While many single station queues possess explicit forms for their equilibrium probabilities, queueing networks are more problematic. Outside of the class of product form networks (e.g., Jackson, Kelly and BCMP networks), one must resort to bounds, simulation, asymptotic studies or approximations. By focusing on a class of two-station closed reentrant queueing networks under the last buffer firs...
متن کامل